Logics capturing local properties

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Logics for Traces

A μ-calculus over dependence graph representation of traces is considered. It is shown that the μ-calculus cannot express all monadic second order (MSO) properties of dependence graphs. Several extensions of the μ-calculus are presented and it is proved that these extensions are equivalent in expressive power to MSO logic. The satisfiability problem for these extensions is PSPACE complete.

متن کامل

Temporal Logics with Local Constraints ∗

Recent decidability results on the satisfiability problem for temporal logics, in particular LTL, CTL∗ and ECTL∗, with constraints over external structures like the integers with the order or infinite trees are surveyed in this paper. 1998 ACM Subject Classification F.4.1 Mathematical Logic

متن کامل

Asymptotic Properties of Logics 1

This paper presents the number of results concerning problems of asymptotic densities in the variety of propositional logics. We investigate, for propositional formulas, the proportion of tautologies of the given length n against the number of all formulas of length n. We are specially interested in asymptotic behavior of this fraction. We show what the relation between a number of premises of ...

متن کامل

Capturing skin properties from dynamic mechanical analyses.

BACKGROUND/PURPOSE Existing skin mechanical testing devices focus on measuring skin elasticity and are not tailored to assess the dynamic behavior of skin. Additionally, the mathematical techniques used in existing devices are often not optimal. METHODS A new dynamic mechanical device that measures the linear dynamics of skin was developed and tested. The mechanical properties of skin were ev...

متن کامل

Logics, local search and resource allocation

The agent metaphor, and models such as the BDI and its evolutions, make it possible to characterize a computational entity as a pro-active system, equipped with (explicit) goals, and with resources and plans to achieve them. In order to execute the actions of a plan, agents may require a number of resources. In the general context of a resource bounded environment, negotiation can be used to ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Computational Logic

سال: 2001

ISSN: 1529-3785,1557-945X

DOI: 10.1145/371282.371388